DFA with a Bounded Activity Level
نویسندگان
چکیده
Lookahead DFAs are used during parsing for sake of resolving conflicts (as described in more detail in the introduction). The parsing of an input string w may require many DFA-explorations starting from different letter positions. This raises the question how many of these explorations can be active at the same time. If there is a bound on this number depending on the given DFA M only (i.e., the bound is valid for all input strings w), we say that M has a bounded activity level. The main results in this paper are as follows. We define an easy-to-check property of DFAs named prefix-cyclicity and show that precisely the non prefix-cyclic DFAs have a bounded activity level. Moreover, the largest possible number `M of mutually overlapping explorations of a given non prefix-cyclic DFA M with t+1 states, the so-called maximum activity level of M , is bounded from above by 2 − 1, and this bound is tight. We show furthermore that the maximum activity levels of equivalent DFAs coincide so as to form an invariant of the underlying regular language, which leads us to a characterization of prefix-cyclicity in terms of the Nerode relation. We finally establish some complexity results. For instance, the problem of computing `M for a given non prefix-cyclic DFA M is shown to be PSPACE-complete.
منابع مشابه
ROBUST RESOURCE-CONSTRAINED PROJECT SCHEDULING WITH UNCERTAIN-BUT-BOUNDED ACTIVITY DURATIONS AND CASH FLOWS II. SOUNDS OF SILENCE: A NEW SAMPLING-BASED HYBRID PRIMARY-SECONDARY CRITERIA HARMONY SEARCH METAHEURISTIC
In this paper, we present a new idea for robust project scheduling combined with a cost-oriented uncertainty investigation. The result of the new approach is a makespan minimal robust proactive schedule, which is immune against the uncertainties in the activity durations and which can be evaluated from a cost-oriented point of view on the set of the uncertain-but-bounded duration and cost param...
متن کاملROBUST RESOURCE-CONSTRAINED PROJECT SCHEDULING WITH UNCERTAIN-BUT-BOUNDED ACTIVITY DURATIONS AND CASH FLOWS I. A NEW SAMPLING-BASED HYBRID PRIMARY-SECONDARY CRITERIA APPROACH
This paper, we presents a new primary-secondary-criteria scheduling model for resource-constrained project scheduling problem (RCPSP) with uncertain activity durations (UD) and cash flows (UC). The RCPSP-UD-UC approach producing a “robust” resource-feasible schedule immunized against uncertainties in the activity durations and which is on the sampling-based scenarios may be evaluated from a cos...
متن کاملPhase Transitions of Bounded Satisfiability Problems
We introduce NL, a learning algorithm for inferring non-deterministic finite-state automata using membership and equivalence queries. More specifically, residual finite-state automata (RFSA) are learned similarly as in Angluin’s popular L algorithm, which, however, learns deterministic finitestate automata (DFA). Like in a DFA, the states of an RFSA represent residual languages. Unlike a DFA, a...
متن کاملar X iv : 1 41 2 . 16 41 v 1 [ cs . F L ] 4 D ec 2 01 4 On k - piecewise testability ( preliminary report )
A language is k-piecewise testable if it is a finite boolean combination of languages of the form Σa1Σ · · ·ΣanΣ, where ai ∈ Σ and 0 ≤ n ≤ k. We investigate the problem, given a minimal DFA recognizing a piecewise testable language, what is the minimal k for which the language is k-piecewise testable? It was shown by Klı́ma and Polák that such a k is bounded by the depth of the minimal DFA. We f...
متن کاملIdentification of a Novel Di-D-Fructofuranose 1,2’:2,3’ Dianhydride (DFA III) Hydrolysis Enzyme from Arthrobacter aurescens SK8.001
Previously, a di-D-fructofuranose 1,2':2,3' dianhydride (DFA III)-producing strain, Arthrobacter aurescens SK8.001, was isolated from soil, and the gene cloning and characterization of the DFA III-forming enzyme was studied. In this study, a DFA III hydrolysis enzyme (DFA IIIase)-encoding gene was obtained from the same strain, and the DFA IIIase gene was cloned and expressed in Escherichia col...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014